Some results on arithmetic codes of composite length

In this paper we present a new upper bound on the minimum distance of binary cyclic arithmetic codes of composite length. Two new classes of binary cyclic arithmetic codes of composite length are introduced. The error correction capability of these codes are discussed and in some cases the actual minimum distance is found. Decoding algorithms based on majority-logic decision are proposed for these codes. 1